Epigraphs of convex set functions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Level Set Characterization of M-convex Functions

This note shows that level sets of a function characterize an M-convex function introduced by Murota.

متن کامل

Optimization Problems with Convex Epigraphs. Application to Optimal Control

For a class of infinite-dimensional minimization problems with nonlinear equality constraints, an iterative algorithm for finding global solutions is suggested. A key assumption is the convexity of the “epigraph”, a set in the product of the image spaces of the constraint and objective functions. A convexification method involving randomization is used. The algorithm is based on the extremal sh...

متن کامل

Singular values of convex functions of matrices

‎Let $A_{i},B_{i},X_{i},i=1,dots,m,$ be $n$-by-$n$ matrices such that $‎sum_{i=1}^{m}leftvert A_{i}rightvert ^{2}$ and $‎sum_{i=1}^{m}leftvert B_{i}rightvert ^{2}$  are nonzero matrices and each $X_{i}$ is‎ ‎positive semidefinite‎. ‎It is shown that if $f$ is a nonnegative increasing ‎convex function on $left[ 0,infty right) $ satisfying $fleft( 0right)‎ ‎=0 $‎, ‎then  $$‎2s_{j}left( fleft( fra...

متن کامل

A New Characterization of M^-convex Set Functions by Substitutability

The concepts of M-convex functions and M^-convex functions play central roles in the theory of discrete convex analysis which has been applied to mathematical economics. On the other hand, substitutability, which is a key property guaranteeing the existence of a stable matching in generalized stable marriage models, is known as a nice property in mathematical economics. In this paper, we introd...

متن کامل

Minimization of convex functions on the convex hull of a point set

A basic algorithm for the minimization of a differentiable convex function (in particular, a strictly convex quadratic function) defined on the convex hull of m points in R is outlined. Each iteration of the algorithm is implemented in barycentric coordinates, the number of which is equal tom. The method is based on a new procedure for finding the projection of the gradient of the objective fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1986

ISSN: 0022-247X

DOI: 10.1016/0022-247x(86)90306-9